Name Venue Year citations
Theory Instantiation. LPAR 2006 41
Superposition Modulo a Shostak Theory. CADE 2003 12
Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation. CADE 2003 0
Shostak Light. CADE 2002 40
Logical Algorithms. ICLP 2002 49
Strict Basic Superposition. CADE 1998 16
Elimination of Equality via Transformation with Ordering Constraints. CADE 1998 33
Soft Typing for Ordered Resolution. CADE 1997 45
Saturation-Based Theorem Proving: Past Successes and Future Potential (Abstract). CADE 1996 0
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract). CADE 1996 14
Ordered Chaining for Total Orderings. CADE 1994 32
Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. LPAR 1992 21
Basic Paramodulation and Superposition. CADE 1992 124
Perfect Model Semantics for Logic Programs with Equality. ICLP 1991 39
On Restrictions of Ordered Paramodulation with Simplification. CADE 1990 148
Completion with History-Dependent Complexities for Generated Equations. ADT 1987 0
Knuth-Bendix Completion for Parametric Specifications with Conditional Equations. ADT 1986 2
Modular Compiler Descriptions based on Abstract Semantic Data Types. ADT 1983 4
Parameterized Specifications - Parameterized Passing and Implementation with Respect to Observability. ADT 1982 0
Copyright ©2019 Universität Würzburg

Impressum | Privacy | FAQ